Constructive Bounds on Ordered Factorizations
نویسندگان
چکیده
منابع مشابه
Constructive Bounds on Ordered Factorizations
The number of ways to factor a natural number into an ordered product of integers, each factor greater than one, is called the ordered factorization of n and is denoted H(n). We show upper and lower bounds on H(n) with explicit constructions.
متن کاملBounds on quantum ordered searching
We prove that any exact quantum algorithm searching an ordered list of N elements requires more than 1 π (ln(N) − 1) queries to the list. This improves upon the previously best known lower bound of 1 12 log 2 (N) − O(1). Our proof is based on a weighted all-pairs inner product argument, and it generalizes to bounded-error quantum algorithms. The currently best known upper bound for exact search...
متن کاملSome constructive bounds on Ramsey numbers
Article history: Received 4 April 2009 Available online 2 February 2010
متن کاملLecture 3 : Constructive Bounds on Discrepancy
In previous lectures we saw a constructive proof of the Lovasz Local Lemma and an application to a variant of the max-min allocations problem. In this lecture we will continue the topic of algorithmic versions of existential theorems with a recent result due to Bansal [Ban10] that makes Spencer’s [Spe85] and Srinavasan’s [Sri97] bounds on discrepancy of set systems constructive. What makes Bans...
متن کاملOn the number of ordered factorizations of natural numbers
We study the number of ways to factor a natural number n into an ordered product of integers, each factor greater than one, denoted by H (n). This counting function from number theory was shown by Newberg and Naor (Adv. Appl. Math. 14 (1993) 172–183) to be a lower bound on the number of solutions to the so-called probed partial digest problem, which arises in the analysis of data from experimen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2005
ISSN: 0895-4801,1095-7146
DOI: 10.1137/s0895480104445861